DSP-128: Stream Cipher Based On Discrete Log Problem And Polynomial Arithmetic
نویسندگان
چکیده
DSP-128 is a new multithreaded stream cipher based on the intractability of the Discrete Logarithm Problem (DLP) with key size of 128-bit. The design of DSP-128 is divided into three stages: Initialization Stage, Keystream Generation Stage, and Encryption Stage. The design goal of DSP-128 is to come up with a secure stream cipher with good performance for data encryption. The experimental results show that the encryption rate of DSP-128 is one time slower (running on single processor) than the widely adapted stream cipher RC4, with a higher level of security against possible cryptanalysis attacks. However, because of its multithreaded nature, DSP-128 can take the speed up advantage of multi-core processor architectures which are available widely.
منابع مشابه
LTSC-128: Stream Cipher Based on the Intractable Shortest Vector Problem in Lattice
AbstrAct: LTSC-128 is a high secure stream cipher based on the hardness of the Shortest Vector Problem in Lattice space. The cipher is based on vectors multiplication over finite field, where these vectors are represented by polynomials to enhance the per formance of keystream generation. The key size is 128 bits and there is no attack faster than exhaustive key search has been identified. The ...
متن کاملAlgebraic Attacks on Stream Ciphers (survey)
Most stream ciphers based on linear feedback shift registers (LFSR) are vulnerable to recent algebraic attacks. In this survey paper, we describe generic attacks: existence of algebraic equations and fast algebraic attacks. The generic attacks only states the existence and gives the upper bound of the complexity. Thus we should find good algebraic equations, case by case, in order to apply the ...
متن کاملEfficient implementation for QUAD stream cipher with GPUs
QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a redu...
متن کاملA discrete logarithm-based approach to compute low-weight multiples of binary polynomials
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized birthday problem. We describe an alternative approach which is based on discrete logarithms and has much lower memory complexity requirements with a comparable time...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کامل